Tight planar packings of two trees
نویسندگان
چکیده
When we consider an embedding of graphs into a plane, it would be nice if it does not intersect internally since the embedding simply shows us the structure of graphs. It is easy to embed a tree into a plane with non-self-intersections. If we embed two or more trees into a plane with non-self-intersections, what occurs? In this paper, we consider embeddings of two trees into a plane with using same vertices, sharing no edges and no-intersections. We prove that a non-star tree and a non-star caterpillar can be embedded into a plane satisfying the above conditions. It is one of the special cases of a conjecture by Garcia et al. [1].
منابع مشابه
Strongly Monotone Drawings of Planar Graphs
A straight-line drawing of a graph is a monotone drawing if for each pair of vertices there is a path which is monotonically increasing in some direction, and it is called a strongly monotone drawing if the direction of monotonicity is given by the direction of the line segment connecting the two vertices. We present algorithms to compute crossing-free strongly monotone drawings for some classe...
متن کاملPacking Trees into Planar Graphs
1 I n t r o d u c t i o n We say that the graphs H 1 , . . . , Hk can be packed into a graph G if G contains subgraphs isomorphic to H 1 , . . . , Hk and pairwise edge disjoint. The problem of packing graphs has been widely studied, especially when G is a complete graph. For instance, it is known that two trees with n vertices none of them equal to a star can be packed into K~ [2]. The packing ...
متن کاملλ-supermodular functions and dual packing theory
The main usage of supermodular functions is to cross out tight sets, that is to use only the following important property. The intersection and the union of two sets with a maximal function value also have maximal function value. But for this purpose we do not need the full strength of supermodularity, some weaker concept suffices. We introduce here a new property, the so called λsupermodularit...
متن کاملPlanar and Plane Slope Number of Partial 2-Trees
We prove tight bounds (up to a small multiplicative or additive constant) for the plane and the planar slope numbers of partial 2-trees of bounded degree. As a byproduct of our techniques, we answer a long standing question by Garg and Tamassia about the angular resolution of the planar straight-line drawings of series-parallel graphs of bounded degree.
متن کاملPeriodic Planar Disk Packings
Several conditions are given when a packing of equal disks in a torus is locally maximally dense, where the torus is defined as the quotient of the plane by a two-dimensional lattice. Conjectures are presented that claim that the density of any strictly jammed packings, whose graph does not consist of all triangles and the torus lattice is the standard triangular lattice, is at most n n+1 π √ 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006